
def bubbleSort(array):
	size = len(array)
	for i in range(0,size):
		for j in range(i,size):
			if array[i] >  array[j]:
				temp = array[i]
				array[i] = array[j]
				array[j] = temp				
	return array

def insertionSort(array):
	size = len(array)
	
	for i in range(0,size-1):
		value = array[i]
		hole = i
		while hole > 0 and array[hole-1] > value:
			array[hole] = array[hole-1]
			hole = hole-1

		array[hole] = value 

	return array

def mergeSort(array):
	pass

def quickSort(array):
	pass


li = [65,12,2,54,13,98]

li = insertionSort(li)

print li


